Matroids with an infinite circuit-cocircuit intersection

نویسندگان

  • Nathan Bowler
  • Johannes Carmesin
چکیده

We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress does not axiomatize all infinite matroids. We show that one of the matroids we define is a thin sums matroid whose dual isn’t a thin sums matroid.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Circuit-cocircuit Intersection Conjecture

Oxley has conjectured that for k ≥ 4, if a matroidM has a k-element set that is the intersection of a circuit and a cocircuit, thenM has a (k− 2)-element set that is the intersection of a circuit and a cocircuit. In this paper we prove a stronger version of this conjecture for regular matroids. We also show that the stronger result does not hold for binary matroids.

متن کامل

Intersections of circuits and cocircuits in binary matroids

Oxley has shown that if, for some k >_-4, a matroid M has a k-element set that is the intersection of a circuit and a cocircuit, then M has a 4-element set that is the intersection of a circuit and a cocircuit. We prove that, under the above hypothesis, for k I> 6, a binary matroid will also have a 6-element set that is the intersection of a circuit and a cocircuit. In addition, we determine ex...

متن کامل

An excluded minors method for infinite matroids

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. We expect that the method we use to prove this will make it possible to lift m...

متن کامل

On the Number of Circuit-cocircuit Reversal Classes of an Oriented Matroid

Gioan introduced the circuit-cocircuit reversal system of an oriented matroid and showed that its cardinality equals the number of bases when the underlying matroid is regular. We prove that the equality fails whenever the underlying matroid is not regular, hence giving a new characterization of regular matroids.

متن کامل

Unavoidable Connected Matroids Retaining a Specified Minor

A sufficiently large connected matroid M contains a big circuit or a big cocircuit. Pou-Lin Wu showed that we can ensure that M has a big circuit or a big cocircuit containing any chosen element of M . In this paper, we begin with a fixed connected matroid N and we take M to be a connected matroid that has N as a minor. Our main result establishes that ifM is sufficiently large, then, up to dua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 107  شماره 

صفحات  -

تاریخ انتشار 2014